1776G - Another Wine Tasting Event - CodeForces Solution

#include <bits/stdc++.h>

using namespace std;

const int nmax = 2e6;

int n;
string s;

long long dp[nmax + 2];
int nrB[nmax + 2];
vector<int> pos;

long long lung[nmax + 2];

int nrCaz[nmax + 2];

void solve(){
    cin >> n >> s;
    int nrW = 0;

    int maxi = 0;
    for(int i = 0; i < n; i++)
        nrW += (s[i] == 'W');
    maxi = nrW;
    for(int i = n; i < s.size(); i++){
        nrW += (s[i] == 'W');
        nrW -= (s[i - n] == 'W');
        maxi = max(nrW, maxi);
    }
    cout << maxi << "\n";
}

int main(){
    ios_base::sync_with_stdio(false), cin.tie(0), std::cout.tie(0);
  
    // freopen("test.in", "r", stdin);
    // freopen("test.out", "w", stdout);

    int q = 1;
    // cin >> q;
    while(q--){
        solve();
    }
    return 0;
}